Piotr Indyk - PDFSEARCH.IO - Document Search Engine

Piotr Indyk
Results: 118

#	Item
11	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity
12	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 15, 2011 Problem Set 2 Solutions Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-03-08 02:53:29 Hashing Information retrieval Information science Search algorithms Hash table Hash function Quadratic probing Cryptographic hash function Linear probing Trie Double hashing Hash list
13	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis April 28, 2011 Problem Set 7 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-13 09:51:42 Ghostbusters Entertainment Gaming Film Proton pack Polynomial Extreme Ghostbusters
14	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 1st, 2011 Problem Set 3 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-03-01 11:09:57 Sorting algorithms Heap Binary heap D-ary heap Merge sort Master theorem Sort Shadow heap Soft heap
15	SFFT Documentation Release 0.1 Jörn Schumacher June 11, 2013 Add to Reading List Source URL: www.spiral.net Language: English - Date: 2013-07-07 08:41:49 Intel C++ Compiler Pkg-config Fast Fourier transform GNU Compiler Collection FFTW Integrated Performance Primitives Fourier transform Piotr Indyk
16	Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis April 28, 2011 Problem Set 7 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-04-29 11:23:37 Ghostbusters Proton pack
17	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 9, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-03-14 16:00:21 Analysis of algorithms Binary trees Computational complexity theory Asymptotic analysis Sorting algorithms Best worst and average case Binary heap Heap Time complexity Hash table Binary search tree Master theorem
18	Introduction to Algorithms Lecture 10 Prof. Piotr Indyk Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-03-31 12:24:56 Sorting algorithms Order theory Mathematics Computer programming Merge sort B-tree Heapsort Insertion sort Comparison sort Tree Decision tree model Time complexity
19	Introduction to Algorithms Lecture 4 Prof. Piotr Indyk Lecture Overview Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-03-31 12:24:53 Binary trees Graph theory Computer programming AVL tree B-tree Tree Binary search tree Tree rotation Scapegoat tree
20	Introduction to Algorithms Lecture 22 Piotr Indyk Outline Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-05 12:42:48 Binary arithmetic Computer arithmetic Division algorithm Digital geometry Mathematics CohenSutherland algorithm Root-finding algorithms Computer science

UPDATE